Turning back time in Markovian process algebra
نویسندگان
چکیده
منابع مشابه
Turning back time in Markovian process algebra
Product-form solutions in Markovian process algebra (MPA) are constructed using properties of reversed processes. The compositionality of MPAs is directly exploited, allowing a large class of hierarchically constructed systems to be solved for their state probabilities at equilibrium. The paper contains new results on both reversed stationary Markov processes as well as MPA itself and includes ...
متن کاملExtended Markovian Process Algebra
EMPA enhances the expressiveness of classical process algebras by integrating functional and performance descriptions of concurrent systems. This is achieved by ooering, besides passive actions (useful for pure nondeterminism), actions whose duration is exponentially distributed as well as immediate actions (useful for performance abstraction), parametrized by priority levels (hence prioritized...
متن کاملGeneralized Semi-Markovian Process Algebra
We present GSMPA, a stochastically timed process algebra that enhances the expressiveness of the stochastically timed process algebra EMPA by allowing arbitrarily distributed durations to be directly modeled through the adoption of the mechanism of action identification as well as the adoption of the preselection policy for alternative actions. GSMPA is introduced together with the definition o...
متن کاملReduction semantics in Markovian process algebra
Stochastic (Markovian) process algebra extend classical process algebra with probabilistic exponentially distributed time durations denoted by rates (the parameter of the exponential distribution). Defining a semantics for such an algebra, so to derive Continuous Time Markov Chains from system specifications, requires dealing with transitions labeled by rates. With respect to standard process a...
متن کاملDifferential Bisimulation for a Markovian Process Algebra
Formal languages with semantics based on ordinary differential equations (ODEs) have emerged as a useful tool to reason about large-scale distributed systems. We present differential bisimulation, a behavioral equivalence developed as the ODE counterpart of bisimulations for languages with probabilistic or stochastic semantics. We study it in the context of a Markovian process algebra. Similarl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00375-4